Properness without Elementaricity

نویسنده

  • SAHARON SHELAH
چکیده

We present reasons for developing a theory of forcing notions which satisfy the properness demand for countable models which are not necessarily elementary sub-models of some (H(χ),∈). This leads to forcing notions which are “reasonably” definable. We present two specific properties materializing this intuition: nep (non-elementary properness) and snep (Souslin non-elementary properness) and also the older Souslin proper. For this we consider candidates (countable models to which the definition applies). A major theme here is “preservation by iteration”, but we also show a dichotomy: if such forcing notions preserve the positiveness of the set of old reals for some naturally defined c.c.c. ideal, then they preserve the positiveness of any old positive set hence preservation by composition of two follows. Last but not least, we prove that (among such forcing notions) the only one commuting with Cohen is Cohen itself; in other words, any other such forcing notion make the set of old reals to a meager set. In the end we present some open problems in this area. 1991 Mathematics Subject Classification. Primary: 03E40 Secondary: 03E05, 03E47.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Properness defects of projections and computation of one point in each connected component of a real algebraic set

Computing at least one point in each connected component of a real algebraic set is a basic subroutine to decide emptiness of semialgebraic sets, which is a fundamental algorithmic problem in effective real algebraic geometry. In this article, we propose a new algorithm for this task, which avoids a hypothesis of properness required in many of the previous methods. We show how studying the set ...

متن کامل

Proper Semirings and Proper Convex Functors

Esik and Maletti introduced the notion of a proper semiring and proved that some important (classes of) semirings – Noetherian semirings, natural numbers – are proper. Properness matters as the equivalence problem for weighted automata over a semiring which is proper and finitely and effectively presented is decidable. Milius generalised the notion of properness from a semiring to a functor. As...

متن کامل

Linear Time - Varying Systems

The notion of properness, well-known for constant linear systems, is generalized to the time-varying case. In a module theoretic framework intrinsic characterizations of input-output system properness are derived. For this, ltrations and the associated Hilbert polyno-mials are used. Classical criteria for properness of polynomial and state representations for constant linear systems are general...

متن کامل

Dynamical properties of the space of Lorentzian metrics

In this article, we try to understand the mechanisms of the non properness of the action of the group of diffeomorphisms on the space of Lorentzian metrics of a compact manifold. We give a first result that describes the dynamical behavior of the sequences of diffeomorphisms involved which entails the existence of metrics that admit an isotropic geodesic foliation of codimension 1. On the 2-tor...

متن کامل

Properness Defects of Projections and Computation of at Least One Point in Each Connected Component of a Real Algebraic Set

Computing at least one point in each connected component of a real algebraic set is a basic subroutine to decide emptiness of semialgebraic sets, which is a fundamental algorithmic problem in effective real algebraic geometry. In this article, we propose a new algorithm for the former task, which avoids a hypothesis of properness required in many of the previous methods. We show how studying th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003